dual linear programming
英 [ˈdjuːəl ˈlɪniə(r) ˈprəʊɡræmɪŋ]
美 [ˈduːəl ˈlɪniər ˈproʊɡræmɪŋ]
网络 对偶线性规划
双语例句
- First, the main procedures and the distinctive features of the most-obtuse-angle ( MOA) row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming.
首先回顾了采用最钝角行、列主元规则求解线性规画问题的原始、对偶可行解的主要过程，阐述了其与众不同的特性。 - This article concerns the shadow cost concept and discusses the relationship between shadow cost and dual price according to linear programming's economic meaning of dual variable and shadow price.
摘要本文根据线性规划问题对偶变数和影子价格的经济意义，给出了影子成本的概念，讨论了影子成本与对偶价格的关系。 - Initiating the construction of CGE model together with its dual linear programming and values traced, the paper expatiates the contribution o.
本文从CGE模型的构建过程以及对偶线性规划、影子价格等方面阐述了线性规划理论与方法对古典经济学理论的贡献。 - The Contradiction Created by the Nonsymmetry of the Dual Linear Programming and Ascertainment of the Shadow Price
对偶线性规划基解不对称性产生的矛盾和影子价格确定 - This paper puts forward a new antithesis model and gives its relevant solution in terms of economics on the question of the optimal industrial resources distribution, based on the complementary relaxation property of dual linear programming theory.
针对工业资源最优配置的问题，运用对偶理论中的互补松弛性质，从经济学的角度上提出了一种新的同伦模型，同时给出了相应的算法。 - Futhemore, the relation between complementary slackness in Kuhn-Tucker Condition and complementary slack theorem on dual linear programming has been showed.
进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系。 - Probing and Analysis of the Property of Dual Linear Programming Problem
对偶线性规划问题性质探析 - A dual algorithm of piecewise linear programming with successively increasing slopes
递增斜率分段线性规划的对偶算法 - After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model, we get an effective algorithm.
通过论证用一般线性规划的对偶算法求解本模型的可行性，使得该模型的求解问题迎刃而解。 - The parameter uncertainty interval estimation ( PIE) problem was transferred into a set of dual linear programming ( DLP) problems, and an improved simplex method was proposed to solve these DLP problems.
将参数不定区间估计（PIE）问题变换成一组对偶线性规划（DLP）问题，提出了求解这组DLP问题的改进单纯形方法。 - Improved Dual Simplex Method for Linear Programming
线性规划一种改进的对偶单纯形法 - A Direct Dual Simplex Method for Linear Programming with Generalized Bounded Varibles
变量有广义界线性规划的直接对偶单纯形法 - A class of solution to dual linear programming problems
对偶线性规划问题的一类解法 - Study of Dual Linear Programming Neural Networks and Selection of Its Learning Rate
对偶线性规划神经网络及算法步长的选取 - Commonsensible Economic Description of Dual Simplex Method for Linear Programming
线性规划对偶单纯形法的常识性经济解释 - Some properties of the dual theory linear programming and sensi-tivety analysis were proved with matrix theory.
本文用矩阵理论给出关于线性规划对偶理论和灵敏度分析几个性质的证明。 - In this paper the meaning and role of shadow prices on the Dual linear programming in the readjustment of Feed formula are discussed.
本文探讨了对偶规划中的影子价格和灵敏度分析在饲料配方调整中的意义和作用。 - Based on the principle of the dual simplex method about linear programming, the changes of the value of the objective function in iterations have been studied.
运用求解线性规划对偶单纯形算法原理，进一步研究迭代过程中目标函数的变化。 - Based on the complementary relaxation property of dual linear programming theory, this paper directly constructs a homotopy model associated with dual linear programming problems to solve.
根据线性规划对偶理论中的互补松弛性质，直接构造线性对偶问题的一个同伦模型，并提出相应的同伦算法求解。 - A method for solving surrogate dual in zero-one linear programming
解0-1线性规划Surrogate对偶的一个方法 - Dual programming of linear fractional programming
一类分式线性规划问题的对偶规划与算法 - A Dual Problem of Linear Programming in Banach Spaces
Banach空间中线性规划的对偶问题 - This paper surveys some methods for solving minimum L1-norm Estimation through mathematical programming, which include ( 1) simplex method, ( 2) dual linear programming, ( 3) gradient projection method and ( 4) active set method.
本文就最小L1-模估计的计算，介绍几种求解的数学规划方法，它们包括：（1）单纯形方法；（2）L1-模估计的对偶规划方法； - Discussion on the conversion methods of problem and dual problem in linear programming
线性规划中原问题与对偶问题转化方法探讨 - Dual Simplex Method of Linear Programming with Bounded Variables
变量有上界的线性规划的对偶单纯形方法 - Besides, a method is introduced to transfer the dual linear programming problem into LCP, thus, the interval iterative algorithm for the dual linear programming problem is obtained.
同时阐述了如何将对偶线性规划问题转化为LCP问题的方法，由此获得计算对偶线性规划问题的区间迭代算法。 - Then using the thought of the surrogate dual of DC programming, the surrogate dual of bilevel linear programming and the duality properties are given.
利用DC规划共轭对偶的思想，讨论解型线性双层规划的共轭对偶规划及其对偶性质。 - It proves equal to the algorithm formed from the dual of semi infinite linear programming.
并证明了它与通过求解半无限线性规划的对偶问题而得到的改进的单纯形法是等价的。 - The article reveals that the shadow price function of a certain resource is a ladder decreased function. The shadow price with economic meaning is not absolutely equal to the solution of dual linear programming.
文章揭示了作为某一资源的影子价格函数是阶梯下降函数，具有经济意义的影子价格不完全等同于对偶问题的解。 - In chapter three we introduce the dual linear programming theory with fuzzy parameters, link the fuzzy matrix game with dual linear programming theory, and give the methods to solve the game.
第三章引入带模糊参数的对偶线性规划理论，把模糊约束矩阵对策与对偶线性规划理论联系起来，从而给出了求解的方法。